TSTP Solution File: SEV397^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV397^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:43:02 EDT 2024
% Result : Theorem 0.16s 0.38s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 47 ( 1 unt; 7 typ; 0 def)
% Number of atoms : 412 ( 123 equ; 0 cnn)
% Maximal formula atoms : 16 ( 10 avg)
% Number of connectives : 327 ( 58 ~; 79 |; 35 &; 143 @)
% ( 9 <=>; 1 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 17 ( 0 ^ 12 !; 5 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cZ: a > $o ).
thf(func_def_2,type,
cY: a > $o ).
thf(func_def_3,type,
cX: a > $o ).
thf(func_def_7,type,
sP0: a > $o ).
thf(func_def_8,type,
sK1: a ).
thf(f53,plain,
$false,
inference(avatar_sat_refutation,[],[f34,f44,f46,f48,f52]) ).
thf(f52,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f51]) ).
thf(f51,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f50,f29]) ).
thf(f29,plain,
( ( $true
!= ( sP0 @ sK1 ) )
| spl2_1 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f27,plain,
( spl2_1
<=> ( $true
= ( sP0 @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f50,plain,
( ( $true
= ( sP0 @ sK1 ) )
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f49,plain,
( ( $true
= ( sP0 @ sK1 ) )
| ( $true != $true )
| ~ spl2_2 ),
inference(superposition,[],[f25,f32]) ).
thf(f32,plain,
( ( $true
= ( cZ @ sK1 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f31,plain,
( spl2_2
<=> ( $true
= ( cZ @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f25,plain,
! [X0: a] :
( ( ( cZ @ X0 )
!= $true )
| ( $true
= ( sP0 @ X0 ) ) ),
inference(duplicate_literal_removal,[],[f20]) ).
thf(f20,plain,
! [X0: a] :
( ( $true
= ( sP0 @ X0 ) )
| ( ( cZ @ X0 )
!= $true )
| ( ( cZ @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: a] :
( ( ( $true
= ( sP0 @ X0 ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( cX @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( cY @ X0 )
!= $true ) ) )
& ( ( ( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true ) )
& ( ( ( cZ @ X0 )
= $true )
| ( ( cY @ X0 )
= $true ) ) )
| ( $true
!= ( sP0 @ X0 ) ) ) ),
inference(flattening,[],[f9]) ).
thf(f9,plain,
! [X0: a] :
( ( ( $true
= ( sP0 @ X0 ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( cX @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( cY @ X0 )
!= $true ) ) )
& ( ( ( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true ) )
& ( ( ( cZ @ X0 )
= $true )
| ( ( cY @ X0 )
= $true ) ) )
| ( $true
!= ( sP0 @ X0 ) ) ) ),
inference(nnf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: a] :
( ( $true
= ( sP0 @ X0 ) )
<=> ( ( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true ) )
& ( ( ( cZ @ X0 )
= $true )
| ( ( cY @ X0 )
= $true ) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[=])]) ).
thf(f48,plain,
( spl2_4
| spl2_2 ),
inference(avatar_split_clause,[],[f47,f31,f41]) ).
thf(f41,plain,
( spl2_4
<=> ( $true
= ( cX @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f47,plain,
( ( $true
= ( cZ @ sK1 ) )
| ( $true
= ( cX @ sK1 ) ) ),
inference(subsumption_resolution,[],[f21,f16]) ).
thf(f16,plain,
! [X0: a] :
( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true )
| ( $true
!= ( sP0 @ X0 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f21,plain,
( ( $true
= ( cZ @ sK1 ) )
| ( $true
= ( cX @ sK1 ) )
| ( $true
= ( sP0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( ( $true
!= ( sP0 @ sK1 ) )
| ( ( $true
!= ( cZ @ sK1 ) )
& ( ( ( cY @ sK1 )
!= $true )
| ( $true
!= ( cX @ sK1 ) ) ) ) )
& ( ( $true
= ( sP0 @ sK1 ) )
| ( $true
= ( cZ @ sK1 ) )
| ( ( ( cY @ sK1 )
= $true )
& ( $true
= ( cX @ sK1 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f12,f13]) ).
thf(f13,plain,
( ? [X0: a] :
( ( ( $true
!= ( sP0 @ X0 ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( ( cY @ X0 )
!= $true )
| ( ( cX @ X0 )
!= $true ) ) ) )
& ( ( $true
= ( sP0 @ X0 ) )
| ( ( cZ @ X0 )
= $true )
| ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) ) ) )
=> ( ( ( $true
!= ( sP0 @ sK1 ) )
| ( ( $true
!= ( cZ @ sK1 ) )
& ( ( ( cY @ sK1 )
!= $true )
| ( $true
!= ( cX @ sK1 ) ) ) ) )
& ( ( $true
= ( sP0 @ sK1 ) )
| ( $true
= ( cZ @ sK1 ) )
| ( ( ( cY @ sK1 )
= $true )
& ( $true
= ( cX @ sK1 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
? [X0: a] :
( ( ( $true
!= ( sP0 @ X0 ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( ( cY @ X0 )
!= $true )
| ( ( cX @ X0 )
!= $true ) ) ) )
& ( ( $true
= ( sP0 @ X0 ) )
| ( ( cZ @ X0 )
= $true )
| ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) ) ) ),
inference(flattening,[],[f11]) ).
thf(f11,plain,
? [X0: a] :
( ( ( $true
!= ( sP0 @ X0 ) )
| ( ( ( cZ @ X0 )
!= $true )
& ( ( ( cY @ X0 )
!= $true )
| ( ( cX @ X0 )
!= $true ) ) ) )
& ( ( $true
= ( sP0 @ X0 ) )
| ( ( cZ @ X0 )
= $true )
| ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) ) ) ),
inference(nnf_transformation,[],[f8]) ).
thf(f8,plain,
? [X0: a] :
( ( ( ( cZ @ X0 )
= $true )
| ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) ) )
<~> ( $true
= ( sP0 @ X0 ) ) ),
inference(definition_folding,[],[f6,f7]) ).
thf(f6,plain,
? [X0: a] :
( ( ( ( cZ @ X0 )
= $true )
| ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) ) )
<~> ( ( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true ) )
& ( ( ( cZ @ X0 )
= $true )
| ( ( cY @ X0 )
= $true ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ( ( ( ( cZ @ X0 )
= $true )
| ( ( cX @ X0 )
= $true ) )
& ( ( ( cZ @ X0 )
= $true )
| ( ( cY @ X0 )
= $true ) ) )
<=> ( ( ( cZ @ X0 )
= $true )
| ( ( ( cY @ X0 )
= $true )
& ( ( cX @ X0 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ( ( ( cZ @ X0 )
| ( cX @ X0 ) )
& ( ( cZ @ X0 )
| ( cY @ X0 ) ) )
<=> ( ( ( cX @ X0 )
& ( cY @ X0 ) )
| ( cZ @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ( ( ( cZ @ X0 )
| ( cX @ X0 ) )
& ( ( cZ @ X0 )
| ( cY @ X0 ) ) )
<=> ( ( ( cX @ X0 )
& ( cY @ X0 ) )
| ( cZ @ X0 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ( ( ( cZ @ X0 )
| ( cX @ X0 ) )
& ( ( cZ @ X0 )
| ( cY @ X0 ) ) )
<=> ( ( ( cX @ X0 )
& ( cY @ X0 ) )
| ( cZ @ X0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.0NwZ2aRGbh/Vampire---4.8_22342',cTHM59_pme) ).
thf(f46,plain,
( spl2_2
| spl2_3 ),
inference(avatar_split_clause,[],[f45,f37,f31]) ).
thf(f37,plain,
( spl2_3
<=> ( ( cY @ sK1 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f45,plain,
( ( $true
= ( cZ @ sK1 ) )
| ( ( cY @ sK1 )
= $true ) ),
inference(subsumption_resolution,[],[f22,f15]) ).
thf(f15,plain,
! [X0: a] :
( ( ( cY @ X0 )
= $true )
| ( ( cZ @ X0 )
= $true )
| ( $true
!= ( sP0 @ X0 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f22,plain,
( ( $true
= ( cZ @ sK1 ) )
| ( ( cY @ sK1 )
= $true )
| ( $true
= ( sP0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f44,plain,
( ~ spl2_3
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f35,f41,f37]) ).
thf(f35,plain,
( ( $true
!= ( cX @ sK1 ) )
| ( ( cY @ sK1 )
!= $true ) ),
inference(subsumption_resolution,[],[f23,f17]) ).
thf(f17,plain,
! [X0: a] :
( ( ( cX @ X0 )
!= $true )
| ( $true
= ( sP0 @ X0 ) )
| ( ( cY @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f23,plain,
( ( $true
!= ( sP0 @ sK1 ) )
| ( ( cY @ sK1 )
!= $true )
| ( $true
!= ( cX @ sK1 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f34,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f24,f31,f27]) ).
thf(f24,plain,
( ( $true
!= ( sP0 @ sK1 ) )
| ( $true
!= ( cZ @ sK1 ) ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SEV397^5 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n012.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 11:47:25 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.16/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.0NwZ2aRGbh/Vampire---4.8_22342
% 0.16/0.38 % (22456)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.16/0.38 % (22457)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.16/0.38 % (22450)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.16/0.38 % (22451)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.16/0.38 % (22456)First to succeed.
% 0.16/0.38 % (22452)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.16/0.38 % (22457)Instruction limit reached!
% 0.16/0.38 % (22457)------------------------------
% 0.16/0.38 % (22457)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (22457)Termination reason: Unknown
% 0.16/0.38 % (22457)Termination phase: Saturation
% 0.16/0.38
% 0.16/0.38 % (22457)Memory used [KB]: 5500
% 0.16/0.38 % (22457)Time elapsed: 0.004 s
% 0.16/0.38 % (22457)Instructions burned: 4 (million)
% 0.16/0.38 % (22457)------------------------------
% 0.16/0.38 % (22457)------------------------------
% 0.16/0.38 % (22455)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.16/0.38 % (22452)Also succeeded, but the first one will report.
% 0.16/0.38 % (22456)Refutation found. Thanks to Tanya!
% 0.16/0.38 % SZS status Theorem for Vampire---4
% 0.16/0.38 % SZS output start Proof for Vampire---4
% See solution above
% 0.16/0.38 % (22456)------------------------------
% 0.16/0.38 % (22456)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (22456)Termination reason: Refutation
% 0.16/0.38
% 0.16/0.38 % (22456)Memory used [KB]: 5500
% 0.16/0.38 % (22456)Time elapsed: 0.004 s
% 0.16/0.38 % (22456)Instructions burned: 2 (million)
% 0.16/0.38 % (22456)------------------------------
% 0.16/0.38 % (22456)------------------------------
% 0.16/0.38 % (22449)Success in time 0.004 s
% 0.16/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------